Distributed Probabilistic Polling and Applications to Proportionate Agreement

Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game

This paper investigates the expected agreement time of a probabilistic polling game on a connected graph. Given a connected graph G with an assignment of a value in {0, 1} to each vertex, we consider a polling game on G that repeats the following π-polling forever, where π = (π1, · · · , πn) is a stochastic vector, i.e., πk ≥ 0, ∑n k=1 πk = 1: For k randomly chosen vertices v with probability π...

Probabilistic consensus via polling and majority rules

In this paper, we consider lightweight decentralised algorithms for achieving consensus in distributed systems. Each member of a distributed group has a private value from a fixed set consisting of, say, two elements, and the goal is for all members to reach consensus on the majority value. We explore variants of the voter model applied to this problem. In the voter model, each node polls a ran...

Polling Systems and eir Applications

Applications of polling systems

Since the first paper on polling systems, written by Mack in 1957, a huge number of papers on this topic has been written. A typical polling system consists of a number of queues, attended by a single server. In several surveys, the most notable ones written by Takagi, detailed and comprehensive descriptions of the mathematical analysis of polling systems are provided. The goal of the present s...

Mixed Polling with Rerouting and Applications

Queueing systems with a single server in which customers wait to be served at a finite number of distinct locations (buffers/queues) are called discrete polling systems. Polling systems in which arrivals of users occur anywhere in a continuum are called continuous polling systems. Often one encounters a combination of the two systems: the users can either arrive in a continuum or wait in a fini...